Improved Construction of Irregular Progressive Edge-Growth Tanner Graphs
نویسندگان
چکیده
منابع مشابه
Improved progressive edge-growth algorithm for fast encodable LDPC codes
The progressive edge-growth (PEG) algorithm is known to construct low-density parity-check (LDPC) codes at finite code lengths with large girths by establishing edges between symbol and check nodes in an edge-by-edge manner. The linear-encoding PEG (LPEG) algorithm, a simple variation of the PEG algorithm, can be applied to generate linear time encodable LDPC codes whose m parity bits p1, p2, ....
متن کاملNeighbourly Irregular Derived Graphs
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کاملEdge irregular total labeling of certain family of graphs
An edge irregular total k-labeling φ : V (G)∪E(G) → {1, 2, . . . , k} of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x′y′ their weights φ(x) + φ(xy) + φ(y) and φ(x′) + φ(x′y′) + φ(y′) are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. We have ...
متن کاملEdge irregular total labellings for graphs of linear size
Confirming a conjecture by Ivančo and Jendrol’ for a large class of graphs we prove that for every graph G = (V,E) of order n, size m and maximum degree ∆ with m > 111000∆ there is a function f : V ∪ E → { 1, 2, ..., ⌈ m+2 3 ⌉} such that f(u) + f(uv) + f(v) 6= f(u′) + f(u′v′) + f(v′) for every uv, u′v′ ∈ E with uv 6= u′v′. Furthermore, we prove the existence of such a function with values up to...
متن کاملEdge-partitioning graphs into regular and locally irregular components
A graph is locally irregular if every two adjacent vertices have distinct degrees. Recently, Baudon et al. introduced the notion of decomposition into locally irregular subgraphs. They conjectured that for almost every graphG, there exists a minimum integer χirr(G) such thatG admits an edge-partition into χ ′ irr(G) classes, each of which induces a locally irregular graph. In particular, they c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2010
ISSN: 1089-7798
DOI: 10.1109/lcomm.2010.101810.101384